Step of Proof: mul_cancel_in_le
12,41
postcript
pdf
Inference at
*
1
I
of proof for Lemma
mul
cancel
in
le
:
1.
a
:
2.
b
:
3.
n
:
4. (
n
*
a
)
(
n
*
b
)
a
b
latex
by ((Assert ((
n
*
a
) < (
n
*
b
))
((
n
*
a
) = (
n
*
b
)))
CollapseTHENA ((Auto_aux (first_nat 1:n
C
) ((first_nat 2:n),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
1
:
C1:
5. ((
n
*
a
) < (
n
*
b
))
((
n
*
a
) = (
n
*
b
))
C1:
a
b
C
.
Definitions
t
T
,
P
Q
,
False
,
P
Q
,
A
,
A
B
,
origin